package LeetCode刷题;

/**
 * @program: Java_Study
 * @author: Xiaofan
 * @createTime: 2021-11-14 15:12
 * @description: Functions of this class is
 * 动态规划:
 * class Solution {
 *     public int minPathSum(int[][] grid) {
 *         if (grid == null || grid.length == 0 || grid[0].length == 0) {
 *             return 0;
 *         }
 *         int rows = grid.length, columns = grid[0].length;
 *         int[][] dp = new int[rows][columns];
 *         dp[0][0] = grid[0][0];
 *         for (int i = 1; i < rows; i++) {
 *             dp[i][0] = dp[i - 1][0] + grid[i][0];
 *         }
 *         for (int j = 1; j < columns; j++) {
 *             dp[0][j] = dp[0][j - 1] + grid[0][j];
 *         }
 *         for (int i = 1; i < rows; i++) {
 *             for (int j = 1; j < columns; j++) {
 *                 dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
 *             }
 *         }
 *         return dp[rows - 1][columns - 1];
 *     }
 * }
 **/
public class NoNo动态规划最小路径和 {
}